package com.hua.array;

public class ArrayDemo08 {
    public static void main(String[] args) {
        int[][] array1 = new int[11][11];

        array1[1][2] = 1;
        array1[2][3] = 2;
        //输出原始的数组；
        for (int[] ints :
                array1) {
            for (int anInt :
                    ints) {
                System.out.print(anInt+"\t");
            }
            System.out.println();
        }
        //转换为稀疏数组保存
        int sum = 0 ;
        //获取有效值的个数
        for (int i = 0; i < 11; i++) {
            for (int j = 0; j < 11; j++) {
                if (array1[i][j]!=0){
                    sum++;
                }

            }
        }
        System.out.println("有效值的个数:"+sum);
        //创建一个稀疏数组
        int[][] array2 = new int[sum+1][3];
        array2[0][0] = 11;//存的行
        array2[0][1] = 11;//存的列
        array2[0][2] = sum;//存的个数
        //遍历二维数组 将非零的数放入稀疏数组
        int count = 0;
        for (int i = 0; i < array1.length; i++) {
            for (int j = 0; j < array1[i].length; j++) {
                if (array1[i][j]!=0){
                    count++;
                    array2[count][0]=i;
                    array2[count][1]=j;
                    array2[count][2]=array1[i][j];
                }
            }
        }
        System.out.println("打印稀疏数组");
        for (int[] ints :
                array2) {
            for (int anInt :
                    ints) {
                System.out.print(anInt+"\t");
            }
            System.out.println();
        }
        System.out.println("还原数组");
        System.out.println("======================");
        int[][] array3 = new int[array2[0][0]][array2[0][1]];

        for (int i = 1; i < array2.length; i++) {
            array3[array2[i][0]][array2[i][1]]= array2[i][2];
        }

        for (int[] ints :
                array3) {
            for (int anInt :
                    ints) {
                System.out.print(anInt+"\t");
            }
            System.out.println();
        }




    }








}
